A new lower bound for the football pool problem for 7 matchespar
نویسنده
چکیده
A new lower bound for the football pool problem for 7 matches par Laurent HABSIEGER 1 R esum e. Notons K 3 (7; 1) le cardinal minimal d'un code ternaire de longueur 7 et de rayon de recouvrement un. Dans un pr ec edent article, nous avons am elior e la minoration K 3 (7; 1) 147 en montrant que K 3 (7; 1) 150. Dans cette note, nous prouvons que K 3 (7; 1) 153. Abstract. Let K 3 (7; 1) denote the minimum cardinality of a ternary code of length 7 and covering radius one. In a previous paper, we improved on the lower bound K 3 (7; 1) 147 by showing that K 3 (7; 1) 150. In this note, we prove that K 3 (7; 1) 153.
منابع مشابه
A New Lower Bound for Flexible Flow Shop Problem with Unrelated Parallel Machines
Flexible flow shop scheduling problem (FFS) with unrelated parallel machines contains sequencing in flow shop where, at any stage, there exists one or more processors. The objective consists of minimizing the maximum completion time. Because of NP-completeness of FFS problem, it is necessary to use heuristics method to address problems of moderate to large scale problem. Therefore, for assessme...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملThe Inverse Football Pool Problem
The minimal number of spheres (without “interior”) of radius n required to cover the finite set {0, . . . , q−1} equipped with the Hamming distance is denoted by T (n, q). The only hitherto known values of T (n, q) are T (n, 3) for n = 1, . . . , 6. These were all given in the 1950s in the Finnish football pool magazine Veikkaaja along with upper and lower bounds for T (n, 3) for n ≥ 7. Recentl...
متن کاملA New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملA Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996